翻訳と辞書 |
Set intersection oracle : ウィキペディア英語版 | Set intersection oracle
A set intersection oracle (SIO) is a data structure which represents a collection of sets and can quickly answer queries about whether the set intersection of two given sets is non-empty. The input to the problem is ''n'' finite sets. The sum of the sizes of all sets is ''N'' (which also means that there are at most ''N'' distinct elements). The SIO should quickly answer any query of the form: : "Does the set ''S''''i'' intersect the set ''S''''k''"? == Minimum memory, maximum query time ==
Without any pre-processing, a query can be answered by inserting the elements of ''S''''i'' into a temporary hash table and then checking for each element of ''S''''k'' whether it is in the hash table. The query time is in average.
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Set intersection oracle」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|